Reflecting BDDs in Coq

Re ecting BDDs in CoqKumar

We describe an implementation and a proof of correctness of binary decision diagrams (BDDs), completely formalized in Coq. This allows us to run BDD-based algorithms inside Coq and paves the way for a smooth integration of symbolic model checking in the Coq proof assistant by using reeection. It also gives us, by Coq's extraction mechanism, certiied BDD algorithms implemented in Caml. We also i...

Re ecting BDDs in

We describe an implementation and a proof of correctness of binary decision diagrams (BDDs), completely formalized in Coq. This allows us to run BDD-based algorithms inside Coq and paves the way for a smooth integration of symbolic model checking in the Coq proof assistant by using reeection. It also gives us, by Coq's extraction mechanism, certiied BDD algorithms implemented in Caml. We also i...

Reflecting Symbolic Model Checking in Coq

برسی هزینه های ارتقاء کیفیت، قبل و بعد از پیاده سازی سیستم COQ (مطالعه موردی در شرکت تولیدی قطعات سایپا)

هدف از این پژوهش محاسبه هزینه های کیفیت طبق مدل P-A-F،  در دایره های مختلف شرکت تولیدی قطعات سایپا طی 2سال قبل و بعد از پیاده سازی سیستم COQمی باشد. نتایج پژوهش با استفاده از آزمون T برای دوگروه وابسته وآزمون  رتبه علامت ویلکاکسون نشان داد که بین هزینه های کیفیت هر دایره در شرکت قبل و بعد از پیاده سازی  سیستم COQ، تفاوت معنی‌داری وجود دارد به طوریکه هزینه های کیفیت بعد از پیاده سازی سیستم COQ ا...

Diierential Bdds ?

In this paper, we introduce a class of Binary Decision Diagrams (BDDs) which we call Differential BDDs ( BDDs), and two transformations over BDDs, called Push-up (") and Delta ( ) transformations. In BDDs and its derived classes such as " BDDs or " BDDs, in addition to the ordinary node-sharing in the normal Ordered Binary Decision Diagrams (OBDDs), some isomorphic substructures are collapsed t...